Characterizing the Shapley value in fixed-route traveling salesman problems with appointments
نویسنده
چکیده
Starting from her home, a service provider visits several customers, following a predetermined route, and returns home after all customers are visited. The problem is to nd a fair allocation of the total cost of this tour among the customers served. A transferableutility cooperative game can be associated with this cost allocation problem. We introduce a new class of games, which we refer as the xed-route traveling salesman games with appointments. We characterize the Shapley Value in this class using a property which requires that sponsors do not bene t from mergers, or splitting into a set of sponsors. JEL Classi cation Codes : C71 Keywords : xed-route traveling salesman games, routing games, appointment games, the Shapley value, the core, transferable-utility games, merging and splitting proofness, networks, cost allocation.
منابع مشابه
Coincidence of cooperative game theoretic solutions in the appointment problem
The fixed-route traveling salesman problem with appointments, simply the appointment problem, is concerned with the following situation. Starting from home, a traveler makes a scheduled visit to a set of sponsors and returns home. If a sponsor in the route cancels her appointment, the traveler returns home and waits for the next appointment. We are interested in finding a way of dividing the to...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملSolving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملSolving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 41 شماره
صفحات -
تاریخ انتشار 2012